Semidirect product constructions of directed strongly regular graphs
نویسندگان
چکیده
منابع مشابه
Lifting constructions of strongly regular Cayley graphs
Article history: Received 21 December 2012 Received in revised form 11 November 2013 Accepted 14 November 2013 Available online 12 December 2013 Communicated by Igor Shparlinski
متن کاملNew prolific constructions of strongly regular graphs
We present a purely combinatorial construction of strongly regular graphs with geometric parameters. The construction produces hyperexponentially many graphs, and uses neither linear algebra nor groups. Among the graphs constructed, there are graphs with parameters of a generalized quadrangle GQðn 1; nþ 1Þ which further produce distance regular covers of complete graphs. In this paper we presen...
متن کاملRepresentations of directed strongly regular graphs
We develop a theory of representations in Rm for directed strongly regular graphs, which gives a new proof of a nonexistence condition of Jørgensen [8]. We also describe some new constructions.
متن کاملSmall vertex-transitive directed strongly regular graphs
We consider directed strongly regular graphs de2ned in 1988 by Duval. All such graphs with n vertices, n6 20, having a vertex-transitive automorphism group, are determined with the aid of a computer. As a consequence, we prove the existence of directed strongly regular graphs for three feasible parameter sets listed by Duval. For one parameter set a computer-free proof of the nonexistence is pr...
متن کاملDirected Strongly Regular Graphs and Their Codes
Directed Strongly Regular Graphs (DSRG) were introduced by Duval as a generalization of strongly regular graphs (SRG’s) [4]. As observed in [8] a special case of these are the doubly regular tournaments or equivalently, the skew Hadamard matrices. As the latter already lead to many interesting codes [10] it is natural to consider the more general case of codes constructed from the adjacency mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2003
ISSN: 0097-3165
DOI: 10.1016/s0097-3165(03)00141-9